1741B - Funny Permutation - CodeForces Solution

constructive algorithms math

Please click on ads to support us..

Python Code: 

t = input()
t = int(t)
while t:
    t -= 1
    n = int(input())
    n = list(range(1,n+1))
    middle = len(n)//2
    left = n[:middle]
    right = n[middle:]
    left = list(reversed(left))
    if len(n)==3:
        print(-1)
    else:
        print(*(right+left))

C++ Code: 

#include <bits/stdc++.h>
using namespace std;

int main()
{
#define int long long int
    int t;
    cin >> t;
    while (t--)
    {
        int n;
        cin >> n;
        if (n == 3)
            cout << -1 << endl;
        else if (n % 2 == 1)
        {
            for (int i = n; i > (n / 2) + 1; i--)
            {
                cout << i << " ";
            }
            for (int i = 1; i <=( n / 2)+1 ; i++)
            {
                cout << i << " ";
            }

            cout << endl;
        }
        else
            for (int i = n; i >= 1; i--)
            {
                cout << i << " ";
            }
        cout << endl;
    }
    return 0;
}


Comments

Submit
0 Comments
More Questions

1038B - Non-Coprime Partition
43A - Football
50A - Domino piling
479A - Expression
1480A - Yet Another String Game
1216C - White Sheet
1648A - Weird Sum
427A - Police Recruits
535A - Tavas and Nafas
581A - Vasya the Hipster
1537B - Bad Boy
1406B - Maximum Product
507B - Amr and Pins
379A - New Year Candles
1154A - Restoring Three Numbers
750A - New Year and Hurry
705A - Hulk
492B - Vanya and Lanterns
1374C - Move Brackets
1476A - K-divisible Sum
1333A - Little Artem
432D - Prefixes and Suffixes
486A - Calculating Function
1373B - 01 Game
1187A - Stickers and Toys
313B - Ilya and Queries
579A - Raising Bacteria
723A - The New Year Meeting Friends
302A - Eugeny and Array
1638B - Odd Swap Sort